Programming complexity - PDFSEARCH.IO - Document Search Engine

Programming complexity
Results: 456

#	Item
261	Managing change and complexity with IBM Rational ClearCase and IBM Rational ClearQuest IBM Rational Change Management Products Highlights Add to Reading List Source URL: www3.software.ibm.com Language: English - Date: 2004-10-28 14:34:09 Computer programming IBM Rational ClearCase IBM Rational ClearQuest IBM Rational Software Modeler IBM Rational Application Developer IBM Rational Software Architect Rational Software IBM WebSphere IBM Rational Performance Tester Software Computing Integrated development environments
262	Under consideration for publication in Theory and Practice of Logic Programming 1 arXiv:1007.4114v1 [cs.LO] 23 Jul 2010 Add to Reading List Source URL: www.cse.unsw.edu.au Language: English - Date: 2010-12-17 06:32:10 Artificial intelligence Constraint logic programming Local consistency Constraint satisfaction problem Constraint satisfaction Structure Answer set programming Valuation Complexity of constraint satisfaction Constraint programming Software engineering Computer programming
263	§1. Algorithmics Lecture I Page 1 Add to Reading List Source URL: cs.nyu.edu Language: English - Date: 2012-09-24 18:59:56 Computational complexity theory Operations research Algorithms Models of computation Decision tree model Sorting algorithm Linear programming Divide and conquer algorithm Pointer machine Theoretical computer science Mathematics Applied mathematics
264	Domain-Driven Design Pattern Summaries Excerpted from Domain-Driven Design: Tackling Complexity in the Heart of Software, by Eric Evans, Addison-Wesley 2004. Add to Reading List Source URL: web.archive.org Language: English Object-oriented programming Software design Software architecture Domain-driven design Domain model Conceptual model Software design pattern ECO Domain Software engineering Software development Computing
265	Space Dilation in Polynomial-Time Perceptron Algorithms Andriy Kharechko∗† [removed] Abstract This talk surveys applications of space dilation in the perceptron-like algorithms for solving systems of linear inequa Add to Reading List Source URL: eprints.pascal-network.org Language: English - Date: 2011-11-30 10:22:02 Operations research Convex optimization Linear programming Combinatorial optimization Computational complexity theory Ellipsoid method Perceptron Mathematical optimization Time complexity Theoretical computer science Applied mathematics Mathematics
266	Approximation Algorithms for Stochastic Orienteering Anupam Gupta∗ Ravishankar Krishnaswamy† Viswanath Nagarajan‡ Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2011-09-30 21:07:28 Combinatorial optimization NP-complete problems Operations research Cryptography Knapsack problem Approximation algorithm Linear programming relaxation SL Matching Theoretical computer science Computational complexity theory Applied mathematics
267	A Calculational Approach to Program Inversion Shin-Cheng Mu Linacre College 23rd January 2003 Add to Reading List Source URL: www.iis.sinica.edu.tw Language: English - Date: 1969-12-31 19:00:00 Operations research Mathematical optimization Mathematical logic Analysis of algorithms Algorithm RSA Dynamic programming Tree traversal Time complexity Mathematics Theoretical computer science Applied mathematics
268	Maintainability Index Revisited - position paper Tobias Kuipers Software Improvement Group, Amsterdam, The Netherlands, [removed] Joost Visser Universidade do Minho, Braga, Portugal, [removed] Abst Add to Reading List Source URL: www.cs.vu.nl Language: English - Date: 2007-02-19 11:04:00 Maintainability Cyclomatic complexity Source lines of code Software maintenance Complexity Computer programming Coupling Software design COBOL Software engineering Software metrics Computing
269	Guiding Planner Backjumping Using Verifier Traces Add to Reading List Source URL: aaai.org Language: English - Date: 2006-01-11 07:53:49 Artificial intelligence Search algorithms Complexity classes Backjumping Backtracking Constraint satisfaction problem Model checking NP IP Theoretical computer science Applied mathematics Constraint programming
270	Complexity across morphological paradigms: A minimum description length approach to identifying inflectional stems Jackson L. Lee and John A. Goldsmith {jsllee,goldsmith}@uchicago.edu University of Chicago Overview: Give Add to Reading List Source URL: jacksonllee.com Language: English - Date: 2014-10-22 18:57:08 Theoretical computer science Linguistic morphology Morphology Combinatorics Dynamic programming Word stem Subsequence Substring Longest common subsequence problem Mathematics Linguistics Grammar